Fast and robust techniques for the euclidean p-median problem with uniform weights
نویسندگان
چکیده
منابع مشابه
Fast and robust techniques for the euclidean p-median problem with uniform weights
We discuss new solution techniques for the p-median problem, with the goal being to improve the solution time and quality of current techniques. In particular, we hybridize the discrete Lloyd algorithm and the vertex substitution heuristic. We also compare three starting point techniques and present a new solution method that provides consistently good results when appropriately initialized.
متن کاملA genetic algorithm for the p-median problem with pos/neg weights
Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated pmedian problem. The proposed GA use...
متن کاملThe extension problem for Lee and Euclidean weights
The extension problem is solved for the Lee and Euclidean weights over three families of rings of the form Z/NZ: N = 2, N = 3, or N = p = 2q + 1 with p and q prime. The extension problem is solved for the Euclidean PSK weight over Z/NZ for all N . 2010 MSC: 94B05
متن کاملThe p-Median Problem
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is NP-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem. Basic construction and improvement algorithms are outlined. Results from the lite...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2009
ISSN: 0360-8352
DOI: 10.1016/j.cie.2009.03.016